Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
x + 0 |
→ x |
| 2: |
|
x + s(y) |
→ s(x + y) |
| 3: |
|
0 + s(y) |
→ s(y) |
| 4: |
|
s(0 + y) |
→ s(y) |
|
There are 3 dependency pairs:
|
| 5: |
|
x +# s(y) |
→ S(x + y) |
| 6: |
|
x +# s(y) |
→ x +# y |
| 7: |
|
S(0 + y) |
→ S(y) |
|
The approximated dependency graph contains 2 SCCs:
{7}
and {6}.
-
Consider the SCC {7}.
There are no usable rules.
By taking the AF π with
π(S) = 1
and π(+) = [2] together with
the lexicographic path order with
empty precedence,
rule 7
is strictly decreasing.
-
Consider the SCC {6}.
There are no usable rules.
By taking the AF π with
π(+#) = 2 together with
the lexicographic path order with
empty precedence,
rule 6
is strictly decreasing.
Hence the TRS is terminating.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006